The Renegotiation-Proofness Principle and Costly Renegotiation
نویسندگان
چکیده
We study contracting and costly renegotiation in settings of complete, but unverifiable information, using the mechanism-design approach. We show how renegotiation activity is best modeled in the fundamentals of the mechanism-design framework, so that noncontractibility of renegotiation amounts to a constraint on the problem. We formalize and clarify the Renegotiation-Proofness Principle (RPP), which states that any state-contingent payoff vector that is implementable in an environment with renegotiation can also be implemented by a mechanism in which renegotiation does not occur in equilibrium. We observe that the RPP is not valid in some settings. However, we prove a general monotonicity result that confirms the RPP’s message about renegotiation opportunities having negative consequences. Our monotonicity theorem states that, as the costs of renegotiation increase, the set of implementable state-contingent payoffs becomes larger.
منابع مشابه
Is multilateral enforcement vulnerable to bilateral renegotiation?
In amultilateral enforcement regime, a player who cheats on one partner is punished bymany partners. But if partners can renegotiate in private, they can subvert the power of the multilateral punishment. We introduce a new notion of “bilateral renegotiation proofness” that applies to multilateral games with private monitoring. For symmetric networked environments, we characterize an optimal bil...
متن کاملRenegotiation-Proof Multilateral Enforcement
In multilateral enforcement, a player who cheats on one partner is punished by many partners. But renegotiation might subvert the threat of multilateral punishment. We consider renegotiation proofness in multilateral enforcement games with public monitoring, and also introduce the notion of “bilateral renegotiation proofness” for games with private monitoring. With public monitoring, renegotiat...
متن کاملOptimality and renegotiation in dynamic contracting
We characterize the optimal renegotiation-proof contract in a dynamic principal–agent model in which the type of the agent may change stochastically over time. We show that, under general conditions, the optimal contract with commitment is renegotiation proof even when type realizations are serially correlated. When the renegotiation-proofness constraint is binding, it is always optimal to part...
متن کاملRenegotiation-Proof Mechanism Design
A mechanism is said to be renegotiation-proof if it is robust against renegotiation both before and after it is played. We ask (1) what kind of environments admit the renegotiation-proof implementation of some social choice rules? (2) for a given environment, what kind of social choice rule are implementable in a way that is renegotiationproof? and (3) for a given renegotiation-proof implementa...
متن کاملRenegotiation-proof contract in repeated agency
Renegotiation-proof contracts are studied in infinitely repeated principal-agent problem. Contracts satisfying a weaker notion of renegotiation-proofness always exist. The renegotiation-proof value function has a simple characterization: It is the principal’s optimal value function when an appropriate lower bound is placed on the agent’s expected utility. Sufficient conditions are provided for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Games
دوره 4 شماره
صفحات -
تاریخ انتشار 2013